Sciweavers

1162 search results - page 153 / 233
» An Information-Based Theory of Conditionals
Sort
View
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 6 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 6 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 6 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
MOBISYS
2007
ACM
16 years 5 months ago
Toward highly-available WSNs for assisted living
In response to the consistent increase of elder people living in their apartments, and the need for innovative non-obtrusive tools to connect elders to their caregivers, we starte...
Safwan Al-Omari, Weisong Shi
DCC
2005
IEEE
16 years 5 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said