Sciweavers

661 search results - page 38 / 133
» Combining Information using Hard Constraints
Sort
View
VL
1999
IEEE
164views Visual Languages» more  VL 1999»
15 years 4 months ago
Reasoning with Spider Diagrams
Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can usefully be used in c...
John Howse, Fernando Molina, John Taylor, Stuart K...
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 19 days ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ICN
2005
Springer
15 years 6 months ago
Information Fusion for Data Dissemination in Self-Organizing Wireless Sensor Networks
Data dissemination is a fundamental task in wireless sensor networks. Because of the radios range limitation and energy consumption constraints, sensor data is commonly disseminate...
Eduardo Freire Nakamura, Carlos Mauricio S. Figuei...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 2 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 16 days ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker