Sciweavers

739 search results - page 138 / 148
» Sorting Algorithms
Sort
View
VRML
1998
ACM
13 years 11 months ago
Simplicial Maps for Progressive Transmission of Polygonal Surfaces
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
André Guéziec, Gabriel Taubin, Franc...
ICCV
2003
IEEE
14 years 9 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
AIRWEB
2007
Springer
14 years 1 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
HPDC
2006
IEEE
14 years 1 months ago
Scheduling Mixed Workloads in Multi-grids: The Grid Execution Hierarchy
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
Mark Silberstein, Dan Geiger, Assaf Schuster, Miro...