Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vladimir Estivill-Castro
2010 – today
- 2013
[c68]Vladimir Estivill-Castro: Integration of Planning and Reasoning into an Architecture That Enables Model-Driven Development. CCIA 2013: 3-4- 2012
- [c67]Vladimir Estivill-Castro, Mahdi Parsa: On the parameterized complexity of dominant strategies. ACSC 2012: 21-26
- [c66]Vladimir Estivill-Castro, René Hexel, David A. Rosenblueth: Efficient Modelling of Embedded Software Systems and their Formal Verification. APSEC 2012: 428-433
- [c65]Robert Coleman, Vladimir Estivill-Castro, René Hexel, Carl Lusty: Visual-Trace Simulation of Concurrent Finite-State Machines for Validation and Model-Checking of Complex Behaviour. SIMPAR 2012: 52-64
- 2011
- [j23]Ickjai Lee, Vladimir Estivill-Castro: Exploration of Massive Crime Data Sets through Data Mining Techniques. Applied Artificial Intelligence 25(5): 362-379 (2011)
- [j22]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera: Fpt-Algorithms for Minimum-Bends Tours. Int. J. Comput. Geometry Appl. 21(2): 189-213 (2011)
- [c64]Vladimir Estivill-Castro, Brendan Bartlett: Image Capture for Concrete Programming - Building Schemata for Problem Solving. CSEDU (1) 2011: 56-68
- [c63]Vladimir Estivill-Castro, David A. Rosenblueth: Model Checking of Transition-Labeled Finite-State Machines. FGIT-ASEA/DRBC/EL 2011: 61-73
- [c62]Vladimir Estivill-Castro: The Instance Easiness of Supervised Learning for Cluster Validity. PAKDD Workshops 2011: 197-208
- 2010
- [j21]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera: NP-completeness and FPT Results for Rectilinear Covering Problems. J. UCS 16(5): 622-652 (2010)
- [c61]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera: The Rectilinear k-Bends TSP. COCOON 2010: 264-277
- [c60]David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Non-monotonic Reasoning for Requirements Engineering - State Diagrams Driven by Plausible Logic. ENASE 2010: 68-77
- [c59]Vladimir Estivill-Castro, Mahdi Parsa: Single Parameter FPT-Algorithms for Non-trivial Games. IWOCA 2010: 121-124
- [c58]David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Modelling Behaviour Requirements for Automatic Interpretation, Simulation and Deployment. SIMPAR 2010: 204-216
2000 – 2009
- 2009
- [j20]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera: Reduction rules deliver efficient FPT-algorithms for covering points with lines. ACM Journal of Experimental Algorithmics 14 (2009)
- [j19]Artak Amirbekyan, Vladimir Estivill-Castro: Practical protocol for Yao's millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets. Knowl. Inf. Syst. 21(3): 327-363 (2009)
- [c57]Vladimir Estivill-Castro, Mahdi Parsa: Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity. CATS 2009: 81-87
- [c56]David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Architecture for Hybrid Robotic Behavior. HAIS 2009: 145-156
- [r1]Kirsten Wahlstrom, John F. Roddick, Rick Sarre, Vladimir Estivill-Castro, Denise de Vries: Legal and Technical Issues of Privacy Preservation in Data Mining. Encyclopedia of Data Warehousing and Mining 2009: 1158-1163
- 2007
- [j18]Kyungmi Lee, Vladimir Estivill-Castro: Feature extraction and gating techniques for ultrasonic shaft signal classification. Appl. Soft Comput. 7(1): 156-165 (2007)
- [c55]Joel Fenwick, Vladimir Estivill-Castro: Mutually Visible Agents in a Discrete Environment. ACSC 2007: 141-150
- [c54]Artak Amirbekyan, Vladimir Estivill-Castro: The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications. ADC 2007: 33-42
- [c53]Artak Amirbekyan, Vladimir Estivill-Castro: A New Efficient Privacy-Preserving Scalar Product Protocol. AusDM 2007: 209-214
- [c52]Artak Amirbekyan, Vladimir Estivill-Castro: Privacy-Preserving k-NN for Small and Large Data Sets. ICDM Workshops 2007: 699-704
- [c51]Vladimir Estivill-Castro, Ahmed HajYasien: Fast Private Association Rule Mining by A Protocol for Securely Sharing Distributed Data. ISI 2007: 324-330
- 2006
- [j17]Ickjai Lee, Vladimir Estivill-Castro: Fast Cluster Polygonization and its Applications in Data-Rich Environments. GeoInformatica 10(4): 399-422 (2006)
- [c50]Ahmed HajYasien, Vladimir Estivill-Castro: Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation. DaWaK 2006: 302-311
- [c49]Artak Amirbekyan, Vladimir Estivill-Castro: Privacy Preserving DBSCAN for Vertically Partitioned Data. ISI 2006: 141-153
- [c48]Ahmed HajYasien, Vladimir Estivill-Castro, Rodney W. Topor: Sanitization of Databases for Refined Privacy Trade-Offs. ISI 2006: 522-528
- [c47]Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. IWPEC 2006: 192-202
- [c46]David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Using Temporal Consistency to Improve Robot Localisation. RoboCup 2006: 232-244
- [c45]Vladimir Estivill-Castro, Stuart Seymon: Mobile Robots for an E-Mail Interface for People Who Are Blind. RoboCup 2006: 338-346
- [e4]Vladimir Estivill-Castro, Gillian Dobbie (Eds.): Computer Science 2006, Twenty-Nineth Australasian Computer Science Conference (ACSC2006), Hobart, Tasmania, Australia, January 16-19 2006. CRPIT 48, Australian Computer Society 2006, ISBN 1-920682-30-9
- 2005
- [c44]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. ACiD 2005: 1-41
- [c43]Joel Fenwick, Vladimir Estivill-Castro: Optimal Paths for Mutually Visible Agents. ISAAC 2005: 869-881
- [c42]Maria Aneiros, Vladimir Estivill-Castro: Usability of Real-Time Unconstrained WWW-Co-Browsing for Educational Settings. Web Intelligence 2005: 105-111
- [e3]Vladimir Estivill-Castro (Ed.): Computer Science 2005, Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, NSW, Australia, January/February 2005. CRPIT 38, Australian Computer Society 2005, ISBN 1-920682-20-1
- 2004
- [j16]Vladimir Estivill-Castro, Jianhua Yang: Fast and Robust General Purpose Clustering Algorithms. Data Min. Knowl. Discov. 8(2): 127-150 (2004)
- [j15]Vladimir Estivill-Castro: Generating Nearly Sorted Sequences - The use of measures of disorder. Electr. Notes Theor. Comput. Sci. 91: 56-95 (2004)
- [c41]Brendan Bartlett, Vladimir Estivill-Castro, Stuart Seymon: Dogs or Robots - Why do Children See Them as Robotic Pets Rather Than Canine Machines? AUIC 2004: 7-14
- [c40]Kyungmi Lee, Vladimir Estivill-Castro: A Hybrid Classification Approach to Ultrasonic Shaft Signals. Australian Conference on Artificial Intelligence 2004: 284-295
- [c39]Vladimir Estivill-Castro: Private Representative-Based Clustering for Vertically Partitioned Data. ENC 2004: 160-167
- [c38]Kyungmi Lee, Vladimir Estivill-Castro: Classification Ensembles for Shaft Test Data: Empirical Evaluation. HIS 2004: 304-309
- [c37]Kyungmi Lee, Vladimir Estivill-Castro: Support Vector Machine Classification of Ultrasonic Shaft Inspection Data Using Discrete Wavelet Transform. IC-AI 2004: 848-854
- [c36]Nathan Lovell, Vladimir Estivill-Castro: A Descriptive Language for Flexible and Robust Object Recognition. RobuCup 2004: 540-547
- [e2]Vladimir Estivill-Castro (Ed.): Computer Science 2004, Twenty-Seveth Australasian Computer Science Conference (ACSC2004), Dunedin, New Zealand, January 2004. CRPIT 26, Australian Computer Society 2004, ISBN 1-920682-05-8
- 2003
- [j14]Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78: 209-222 (2003)
- [c35]Vladimir Estivill-Castro, Jianhua Yang: Cluster Validity Using Support Vector Machines. DaWaK 2003: 244-256
- [c34]Maria Aneiros, Vladimir Estivill-Castro, Chengzheng Sun: Group unified histories an instrument for productive unconstrained co-browsing. GROUP 2003: 330-338
- [c33]Kyungmi Lee, Vladimir Estivill-Castro: Feature Extraction Techniques for Ultrasonic Shaft Signal Classification. HIS 2003: 479-488
- [c32]Vladimir Estivill-Castro, Darren Lattin, Francis Suraweera, Vasanthe Vithanage: Tracking bees - a 3D, outdoor small object environment. ICIP (3) 2003: 1021-1024
- [c31]Vladimir Estivill-Castro, Nathan Lovell: Improved Object Recognition - The RoboCup 4-Legged League. IDEAL 2003: 1123-1130
- [c30]Maria Aneiros, Vladimir Estivill-Castro: Foundations of Unconstrained Collaborative Web Browsing with Awareness. Web Intelligence 2003: 18-25
- 2002
- [j13]Vladimir Estivill-Castro, Ickjai Lee: Multi-Level Clustering and its Visualization for Exploratory Spatial Analysis. GeoInformatica 6(2): 123-152 (2002)
- [j12]Vladimir Estivill-Castro, Jianhua Yang: Clustering Web Visitors by Fast, Robust and Convergent Algorithms. Int. J. Found. Comput. Sci. 13(4): 497-520 (2002)
- [j11]Vladimir Estivill-Castro: Why so many clustering algorithms: a position paper. SIGKDD Explorations 4(1): 65-75 (2002)
- [c29]Rodolfo Torres-Velázquez, Vladimir Estivill-Castro: A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem. EvoWorkshops 2002: 173-182
- 2001
- [j10]Vladimir Estivill-Castro, Michael E. Houle: Robust Distance-Based Clustering with Applications to Spatial Data Mining. Algorithmica 30(2): 216-242 (2001)
- [c28]Ickjai Lee, Vladimir Estivill-Castro: Effective and Efficient Boundary-based Clustering for Three-Dimensional Geoinformation Studies. CODAS 2001: 87-96
- [c27]Vladimir Estivill-Castro, Ickjai Lee: Fast Spatial Clustering with Different Metrics and in the Presence of Obstacles. ACM-GIS 2001: 142-147
- [c26]Vladimir Estivill-Castro, Ickjai Lee, Alan T. Murray: Criteria on Proximity Graphs for Boundary Extraction and Spatial Clustering. PAKDD 2001: 348-357
- [c25]Vladimir Estivill-Castro, Michael E. Houle: Data Structures for Minimization of Total Within-Group Distance for Spatio-temporal Clustering. PKDD 2001: 91-102
- [c24]Vladimir Estivill-Castro, Jianhua Yang: Non-crisp Clustering by Fast, Convergent, and Robust Algorithms. PKDD 2001: 103-114
- [c23]Vladimir Estivill-Castro, Jianhua Yang: Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs. Web Intelligence 2001: 498-507
- 2000
- [j9]Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia: On the chromatic number of tree graphs. Discrete Mathematics 223(1-3): 363-366 (2000)
- [c22]Vladimir Estivill-Castro, Jianhua Yang: Fast and Robust General Purpose Clustering Algorithms. PRICAI 2000: 208-218
- [c21]Vladimir Estivill-Castro: Hybrid Genetic Algorithms Are Better for Spatial Clustering. PRICAI 2000: 424-434
- [c20]Vladimir Estivill-Castro, Michael E. Houle: Fast Randomized Algorithms for Robust Estimation of Location. TSDM 2000: 77-88
- [c19]Vladimir Estivill-Castro, Ickjai Lee: AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles. TSDM 2000: 133-146
- [e1]Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma (Eds.): Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, ISBN 3-540-67787-9
1990 – 1999
- 1999
- [c18]Vladimir Estivill-Castro, Michael E. Houle: Robust Clustering of Large Data Sets with Categorial Attributes. Australasian Database Conference 1999: 165-176
- [c17]
- [c16]Vladimir Estivill-Castro, Ljiljana Brankovic: Data Swapping: Balancing Privacy against Precision in Mining for Logic Rules. DaWaK 1999: 389-398
- [c15]Vladimir Estivill-Castro, Michael E. Houle: Robust Clustering of Large Geo-referenced Data Sets. PAKDD 1999: 327-337
- 1998
- [j8]Alan T. Murray, Vladimir Estivill-Castro: Cluster Discovery Techniques for Exploratory Spatial Data Analysis. International Journal of Geographical Information Science 12(5): 431-443 (1998)
- [j7]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geometry Appl. 8(1): 25-38 (1998)
- [c14]Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez: Randomized K-Dimensional Binary Search Trees. ISAAC 1998: 199-208
- [c13]Vladimir Estivill-Castro, Alan T. Murray: Discovering Associations in Spatial Data - An Efficient Medoid Based Approach. PAKDD 1998: 110-121
- [c12]Vladimir Estivill-Castro, Rodolfo Torres-Velázquez: Hybrid Genetic Algorithm for Solving the p-Median Problem. SEAL 1998: 19-25
- 1997
- [c11]Vladimir Estivill-Castro: Collaborative Knowledge Acquisition with a Genetic Algorithm. ICTAI 1997: 270-277
- 1995
- [j6]
- [j5]Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu: Illumination of Polygons with Vertex Lights. Inf. Process. Lett. 56(1): 9-13 (1995)
- [c10]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371
- [c9]Vladimir Estivill-Castro, Jorge Urrutia: Two-Floodlight Illumination of Convex Polygons. WADS 1995: 62-73
- 1994
- [c8]Vladimir Estivill-Castro, Jorge Urrutia: Optimal Floodlight Illumination of Orthogonal Art Galleries. CCCG 1994: 81-86
- [c7]Vladimir Estivill-Castro, Derick Wood: Foundations for Faster External Sorting (Extended Abstract). FSTTCS 1994: 414-425
- 1993
- [j4]Vladimir Estivill-Castro, Heikki Mannila, Derick Wood: Right Invariant Metrics and Measures of Presortedness. Discrete Applied Mathematics 42(1): 1-16 (1993)
- [j3]Vladimir Estivill-Castro, Derick Wood: Randomized Adative Sorting. Random Struct. Algorithms 4(1): 37-58 (1993)
- [c6]Vladimir Estivill-Castro, Derick Wood: An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. ICCI 1993: 8-12
- [c5]Vladimir Estivill-Castro: The Design of Competitive Algorithms via Genetic Algorithms. ICCI 1993: 305-309
- 1992
- [j2]Vladimir Estivill-Castro, Derick Wood: A Survey of Adaptive Sorting Algorithms. ACM Comput. Surv. 24(4): 441-476 (1992)
- [c4]
- 1991
- [c3]Vladimir Estivill-Castro, Derick Wood: Sorting, Measures of Disorder, and Worst-Case Performance. New Results and New Trends in Computer Science 1991: 124-131
- [c2]
- [c1]Vladimir Estivill-Castro, Murray Sherk: Competitiveness and Response Time in On-Line Algorithms. ISA 1991: 284-293
1980 – 1989
- 1989
- [j1]Vladimir Estivill-Castro, Derick Wood: A New Measure of Presortedness. Inf. Comput. 83(1): 111-119 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16 21:29 CEST by the dblp team