Sciweavers

697 search results - page 21 / 140
» Approximation of Information Granule Sets
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 12 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
15 years 12 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
DAGSTUHL
2008
15 years 1 months ago
Interactive Multiobjective Optimization Using a Set of Additive Value Functions
Abstract. In this chapter, we present a new interactive procedure for multiobjective optimization, which is based on the use of a set of value functions as a preference model built...
José Rui Figueira, Salvatore Greco, Vincent...
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
15 years 4 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
CIKM
2006
Springer
15 years 3 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li