Sciweavers

1604 search results - page 218 / 321
» Approximation algorithms for developable surfaces
Sort
View
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 6 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
CISS
2008
IEEE
15 years 8 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
WABI
2005
Springer
15 years 7 months ago
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. C...
UAI
2001
15 years 2 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
ICML
2009
IEEE
15 years 8 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...