Sciweavers

4797 search results - page 78 / 960
» The complexity of partition tasks
Sort
View
CHI
2007
ACM
16 years 7 months ago
Computer aided observations of complex mobile situations
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
Tobias Klug
CP
2005
Springer
16 years 8 days ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
217
Voted
JDWM
2006
178views more  JDWM 2006»
15 years 6 months ago
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining ta...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
TREC
2001
15 years 8 months ago
More Reflections on "Aboutness" TREC-2001 Evaluation Experiments at Justsystem
The TREC-2001 Web track evaluation experiments at the Justsystem site are described with a focus on the "aboutness" based approach in text retrieval. In the web ad hoc t...
Sumio Fujita
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 8 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...