Sciweavers

1331 search results - page 263 / 267
» Complexity bounds for zero-test algorithms
Sort
View
EMSOFT
2004
Springer
14 years 1 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ICDM
2003
IEEE
101views Data Mining» more  ICDM 2003»
14 years 27 days ago
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
Jörg A. Walter, Jörg Ontrup, Daniel Wess...
ICDCS
2000
IEEE
14 years 18 hour ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
SIGGRAPH
1999
ACM
13 years 12 months ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
SIGGRAPH
2010
ACM
13 years 11 months ago
FASTCD: fracturing-aware stable collision detection
We present a collision detection (CD) method for complex and large-scale fracturing models that have geometric and topological changes. We first propose a novel dual-cone culling...
Jae-Pil Heo, Duksu Kim, Joon-Kyung Seong, Jeong-Mo...