Sciweavers

3708 search results - page 631 / 742
» Approximating Betweenness Centrality
Sort
View
86
Voted
IPL
2008
89views more  IPL 2008»
15 years 20 days ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
105
Voted
COMGEO
2007
ACM
15 years 20 days ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
IJCV
2006
145views more  IJCV 2006»
15 years 20 days ago
Simultaneous Object Recognition and Segmentation from Single or Multiple Model Views
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
74
Voted
IJHPCA
2006
96views more  IJHPCA 2006»
15 years 20 days ago
On the User - Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
Cynthia Bailey Lee, Allan Snavely
84
Voted
JAR
2008
81views more  JAR 2008»
15 years 20 days ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah