Sciweavers

169 search results - page 6 / 34
» Efficient search space exploration for HW-SW partitioning
Sort
View
111
Voted
SOFSEM
2000
Springer
15 years 3 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 2 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 1 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
VLSID
2002
IEEE
149views VLSI» more  VLSID 2002»
16 years 22 hour ago
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-Chip
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
Yunsi Fei, Niraj K. Jha
MM
2009
ACM
185views Multimedia» more  MM 2009»
15 years 6 months ago
Deep exploration for experiential image retrieval
Experiential image retrieval systems aim to provide the user with a natural and intuitive search experience. The goal is to empower the user to navigate large collections based on...
Bart Thomee, Mark J. Huiskes, Erwin M. Bakker, Mic...