Sciweavers

3889 search results - page 69 / 778
» A Framework for Optimizing Paper Matching
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
15 years 11 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ENTCS
2006
155views more  ENTCS 2006»
14 years 9 months ago
Mathematical Service Trading Based on Equational Matching
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
Aurélie Hurault, Marc Pantel
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
15 years 3 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
IJCAI
2003
14 years 11 months ago
An Extension of the ICP Algorithm for Modeling Nonrigid Objects with Mobile Robots
The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Build...
Dirk Hähnel, Sebastian Thrun, Wolfram Burgard
INFOCOM
2012
IEEE
13 years 8 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...