882 search results - page 138 / 177 » On the Hardness of Graph Isomorphism |
138
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
286
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
174
click to vote
DASFAA
2009
IEEE
16 years 18 days ago
2009
IEEE
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materia...
131
click to vote
LICS
2009
IEEE
16 years 13 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
175
click to vote
ADHOCNETS
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...