Sciweavers

3820 search results - page 466 / 764
» Bounded Model Debugging
Sort
View
127
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
163
Voted
ALT
2002
Springer
16 years 19 days ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
154
Voted
ISBI
2009
IEEE
15 years 10 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
132
Voted
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 10 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
119
Voted
ECUMN
2007
Springer
15 years 10 months ago
Toward Scalable Management of Multiple Service Levels in IP Networks
This paper analyzes and discusses the role of a distributed and simple admission control (AC) model in achieving scalable management of multiple network service levels. The model ...
Solange Rito Lima, Paulo Carvalho, Vasco Freitas