Sciweavers

855 search results - page 25 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
93
Voted
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 28 days ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
ECCV
2000
Springer
15 years 11 months ago
Coupled Geodesic Active Regions for Image Segmentation: A Level Set Approach
Abstract. This paper presents anovel variational method forimage segmentation that uni es boundary and region-based information sources under the Geodesic Active Region framework. ...
Nikos Paragios, Rachid Deriche
JC
2006
139views more  JC 2006»
14 years 9 months ago
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
Branimir Lambov
90
Voted
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov