Sciweavers

4315 search results - page 251 / 863
» Sorting in linear time
Sort
View
DAC
2006
ACM
14 years 10 months ago
Generation of yield-aware Pareto surfaces for hierarchical circuit design space exploration
Pareto surfaces in the performance space determine the range of feasible performance values for a circuit topology in a given technology. We present a non-dominated sorting based ...
Saurabh K. Tiwary, Pragati K. Tiwary, Rob A. Ruten...
SIGCSE
2009
ACM
132views Education» more  SIGCSE 2009»
14 years 10 months ago
Retina: helping students and instructors based on observed programming activities
It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...
Christian Murphy, Gail E. Kaiser, Kristin Loveland...
DCC
2005
IEEE
14 years 9 months ago
TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes
We use the abbreviations tet and tri for tetrahedron and triangle. TetStreamer encodes a Delaunay tet mesh in a back-to-front visibility order and streams it from a server to a cl...
Urs Bischoff, Jarek Rossignac
ICRA
2006
IEEE
103views Robotics» more  ICRA 2006»
14 years 3 months ago
A Time-budgeted Collision Detection Method
- Collision detection is a critical module in many applications such as computer graphics, robot motion planning, physical simulation, CAD/CAM, and molecular modeling. Many efficie...
Yu-Te Lin, Tsai-Yen Li
SPIRE
2005
Springer
14 years 3 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel