Sciweavers

4212 search results - page 132 / 843
» On Compressible Pairings and Their Computation
Sort
View
TCS
2008
15 years 5 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 6 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
ALGOSENSORS
2004
Springer
15 years 12 months ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
ICRA
2002
IEEE
88views Robotics» more  ICRA 2002»
15 years 11 months ago
Curvature-Based Computation of Antipodal Grasps
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical reso...
Yan-Bin Jia
LREC
2008
141views Education» more  LREC 2008»
15 years 8 months ago
Centering Theory for Evaluation of Coherence in Computer-Aided Summaries
This paper investigates a new evaluation method for assessing the coherence of computer-aided summaries, justified by the inappropriacy of existing evaluation methods for this tas...
Laura Hasler