Sciweavers

2925 search results - page 136 / 585
» Information Complexity of Online Problems
Sort
View
CIKM
1999
Springer
15 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
INFOCOM
2007
IEEE
16 years 23 days ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
IEAAIE
2001
Springer
15 years 11 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
LWA
2007
15 years 7 months ago
Retrieval of technical drawings in DXF format - concepts and problems
Nowadays, launching new products in short intervals is a critical factor for success to persist on the global market. At the same time many enterprises call for cost reduction in ...
Nadine Weber, Andreas Henrich
GI
2005
Springer
15 years 12 months ago
Trust and quality in electronic communication: Getting to know your customers bit by bit
: A client was experiencing trust and information quality problems in his structured Internet communication with potential and existing customers. Customer information entered onli...
Andreas Neus, Philipp Scherf, Christian Gebert