2370 search results - page 213 / 474 » A Structured Set of Higher-Order Problems |
146
click to vote
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
175
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
124
click to vote
CAD
2005
Springer
15 years 3 months ago
2005
Springer
Heterogeneous structures represent an important new frontier for 21st century engineering. Human tissues, composites, `smart' and multimaterial objects are all physically man...
161
click to vote
BMCBI
2004
15 years 3 months ago
2004
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
128
click to vote
COMAD
2008
15 years 5 months ago
2008
Today, information integration has assumed a completely different, complex connotation than what it used to be. The advent of the Internet, the proliferation of information source...