10412 search results - page 1845 / 2083 » The efficiency of algorithms - misconceptions |
164
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Integrity constraints (ICs) play a key role in the definition of conceptual schemas. In the UML, ICs are usually specified as invariants written in the OCL. However, due to the hi...
161
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
142
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
136
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
184
click to vote
TC
2008
15 years 4 months ago
2008
As one of the fundamental issues in wireless sensor networks (WSNs), the sensor localization problem has recently received extensive attention. In this work, we investigate this pr...