Sciweavers

1088 search results - page 217 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 6 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
125
Voted
SASN
2004
ACM
15 years 5 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
SENSYS
2004
ACM
15 years 5 months ago
Mitigating congestion in wireless sensor networks
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...
Bret Hull, Kyle Jamieson, Hari Balakrishnan
108
Voted
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 3 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 1 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran