1414 search results - page 228 / 283 » Cover Time and Broadcast Time |
ALENEX
2001
13 years 11 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
ICWS
2004
IEEE
13 years 11 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
WSCG
2004
13 years 11 months ago
2004
In recent times, subdivision surfaces have been considered a powerful representation for shape design. They have been successfully introduced in character animation software packa...
IJCAI
1997
13 years 11 months ago
1997
Practical applications of description logics (DLs) in knowledge-based systems have forced us to introduce the following features which are absent from existing DLs: • allowing a...
CCCG
2009
13 years 11 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...