3455 search results - page 451 / 691 » Generalized Game Trees |
186
click to vote
APPINF
2003
15 years 8 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
183
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
176
click to vote
WSCG
2004
15 years 8 months ago
2004
This paper presents an interactive environment for texturing surfaces of arbitrary 3D objects. By uniquely using solid textures and applying them to the surface, we do not require...
169
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
191
click to vote
WOA
2007
15 years 7 months ago
2007
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...