Sciweavers

2004 search results - page 285 / 401
» Sampling from large graphs
Sort
View
128
Voted
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 2 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
218
Voted
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
16 years 2 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
111
Voted
ISMAR
2007
IEEE
15 years 8 months ago
A System Architecture for Ubiquitous Tracking Environments
Ubiquitous tracking setups, covering large tracking areas with many heterogeneous sensors of varying accuracy, require dedicated middleware to facilitate development of stationary...
Manuel Huber, Daniel Pustka, Peter Keitler, Floria...
SCIA
2009
Springer
261views Image Analysis» more  SCIA 2009»
15 years 7 months ago
Dense and Deformable Motion Segmentation for Wide Baseline Images
In this paper we describe a dense motion segmentation method for wide baseline image pairs. Unlike many previous methods our approach is able to deal with deforming motions and lar...
Juho Kannala, Esa Rahtu, Sami S. Brandt, Janne Hei...
108
Voted
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 6 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...