Sciweavers

126 search results - page 22 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
MOBICOM
2006
ACM
15 years 3 months ago
Coverage and connectivity in three-dimensional networks
Although most wireless terrestrial networks are based on twodimensional (2D) design, in reality, such networks operate in threedimensions (3D). Since most often the size (i.e., th...
S. M. Nazrul Alam, Zygmunt J. Haas
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICIP
2002
IEEE
15 years 11 months ago
A method for color naming and description of color composition in images
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
Aleksandra Mojsilovic
CGF
2004
86views more  CGF 2004»
14 years 9 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek