Sciweavers

1554 search results - page 140 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
140
Voted
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 9 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 4 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
110
Voted
GEOINFO
2004
15 years 5 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
125
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
170
Voted
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 11 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson