5100 search results - page 868 / 1020 » The Linear Complexity of a Graph |
164
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
128
click to vote
HT
2003
ACM
15 years 11 months ago
2003
ACM
Graph-centric and node-centric browsing are the two commonly identified hypertext-browsing paradigms. We believe that pathcentric browsing, the browsing behavior exhibited by path...
143
click to vote
HT
2003
ACM
15 years 11 months ago
2003
ACM
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
148
click to vote
SIGGRAPH
2003
ACM
15 years 11 months ago
2003
ACM
Blend shape animation is the method of choice for keyframe facial animation: a set of blend shapes (key facial expressions) are used to define a linear space of facial expression...
153
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...