3702 search results - page 606 / 741 » All Pairings Are in a Group |
171
click to vote
MIDDLEWARE
2007
Springer
16 years 18 days ago
2007
Springer
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
203
click to vote
WADS
2007
Springer
16 years 17 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
194
click to vote
CIMCA
2006
IEEE
16 years 16 days ago
2006
IEEE
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
159
click to vote
FCCM
2006
IEEE
16 years 16 days ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
157
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...