Sciweavers

1523 search results - page 188 / 305
» Partially ordered secretaries
Sort
View
180
Voted
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 29 days ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 29 days ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
93
Voted
DCC
2007
IEEE
16 years 12 days ago
On the structure of 1-designs with at most two block intersection numbers
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
John Arhin
88
Voted
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
15 years 10 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
103
Voted
ICDAR
2009
IEEE
15 years 7 months ago
Recognition of Degraded Handwritten Characters Using Local Features
The main problems of Optical Character Recognition (OCR) systems are solved if printed latin text is considered. Since OCR systems are based upon binary images, their results are ...
Markus Diem, Robert Sablatnig