Sciweavers

2370 search results - page 207 / 474
» A Structured Set of Higher-Order Problems
Sort
View
COMPGEOM
1994
ACM
15 years 8 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
BIRTHDAY
2010
Springer
15 years 5 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
WWW
2003
ACM
16 years 4 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
COMPGEOM
2005
ACM
15 years 5 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
BMCBI
2007
144views more  BMCBI 2007»
15 years 4 months ago
Application of amino acid occurrence for discriminating different folding types of globular proteins
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
Y.-h. Taguchi, M. Michael Gromiha