Sciweavers

882 search results - page 135 / 177
» Local Search for Very Large SAT Problems
Sort
View
CIKM
1999
Springer
15 years 8 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...
ICIP
2002
IEEE
16 years 5 months ago
Fast and effective characterization of 3D region data
We consider the problem of characterization of spatial region data such as the regions of interest (ROIs) in medical images. We propose a method that efficiently extracts a k-dime...
Vasileios Megalooikonomou, Haimonti Dutta, Despina...
ESWS
2007
Springer
15 years 7 months ago
Towards Novel Techniques for Reasoning in Expressive Description Logics based on Binary Decision Diagrams
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
Uwe Keller
ADHOC
2006
97views more  ADHOC 2006»
15 years 3 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
EUROPAR
2009
Springer
15 years 10 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity