Sciweavers

486 search results - page 9 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
14 years 7 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
AAAI
2011
12 years 7 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
IPPS
1996
IEEE
13 years 11 months ago
An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...
Hong Q. Ding, Robert D. Ferraro
IPPS
2006
IEEE
14 years 1 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...