Sciweavers

10907 search results - page 182 / 2182
» Constraint Based Strategies
Sort
View
80
Voted
ISMIS
2009
Springer
15 years 4 months ago
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Fran&cc...
IPSN
2007
Springer
15 years 4 months ago
Power scheduling for wireless sensor and actuator networks
We previously presented a model for some wireless sensor and actuator network (WSAN) applications based on the vector space tools of frame theory. In this WSAN model there is a we...
Christopher J. Rozell, Don H. Johnson
92
Voted
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 3 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
85
Voted
ICPR
2010
IEEE
15 years 1 months ago
Quasi-Dense Wide Baseline Matching for Three Views
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
90
Voted
PC
1998
153views Management» more  PC 1998»
14 years 10 months ago
Compilation Techniques for Out-of-Core Parallel Computations
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...