3778 search results - page 502 / 756 » Representing Web Graphs |
121
click to vote
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
131
click to vote
PPSN
2000
Springer
15 years 8 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
124
click to vote
FASE
2010
Springer
15 years 8 months ago
2010
Springer
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
290
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
153
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...