Sciweavers

340 search results - page 38 / 68
» Clustering with Lower Bound on Similarity
Sort
View
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 25 days ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 6 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
201
Voted
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
16 years 2 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh
CLUSTER
2005
IEEE
15 years 6 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
102
Voted
ICIP
2006
IEEE
16 years 2 months ago
Self-Modulated Halftones
We propose an analytic method to overcome the trade-off between the spatial and tonal resolution of traditional clustered dot halftones. Continuous phase modulated halftones that ...
Basak Oztan, Gaurav Sharma