2373 search results - page 360 / 475 » Complexities for generalized models of self-assembly |
135
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
234
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
225
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
181
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
126
Voted
ICSE
2008
IEEE-ACM
16 years 4 months ago
2008
IEEE-ACM
Because the knowledge required for the construction of a complex software system is often widely distributed among its members, programmers routinely engage in collaboration with ...