999 search results - page 67 / 200 » Constraints in Non-Boolean Contexts |
169
click to vote
CACM
2002
15 years 6 months ago
2002
Developers of context-aware services, i.e. services that make use of sensory information from the environment of their users, often find testing and demonstrating services to be di...
176
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Matching based on local brightness is quite limited, because
small changes on local appearance invalidate the
constancy in brightness. The root of this limitation is its
treatme...
159
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such ...
143
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
163
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...