Sciweavers

8647 search results - page 422 / 1730
» The Container Selection Problem
Sort
View
ICALP
2009
Springer
16 years 1 months ago
Approximating Decision Trees with Multiway Branches
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
LICS
2008
IEEE
16 years 1 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
ARCS
2005
Springer
16 years 11 days ago
Organic Architectures for Large-Scale Environment-Aware Sensor Networks
This paper examines how methods inspired by biological processes can be applied to the design of large-scale environment-aware sensor networks. Our ultimate goal are systems conta...
Paul Lukowicz, Erhardt Barth, Jan T. Kim
SAS
2004
Springer
16 years 5 days ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...