2907 search results - page 257 / 582 » Presentations of Structures in Admissible Sets |
208
click to vote
FLAIRS
2009
15 years 4 months ago
2009
For certain disable persons unable to communicate, we present a palliative aid which consist of a virtual pictographic keyboard associated to a text processing from a pictographic...
198
click to vote
SIBGRAPI
2008
IEEE
16 years 1 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...
189
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
180
click to vote
SIGIR
1996
ACM
15 years 10 months ago
1996
ACM
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
164
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...