Sciweavers

403 search results - page 36 / 81
» Plenoptic path and its applications
Sort
View
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 10 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
SPAA
2006
ACM
14 years 1 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
LISA
2003
13 years 9 months ago
Three Practical Ways to Improve Your Network
This paper presents three simple techniques for improving network service using relatively unknown features of many existing networks. The resulting system provides greater reliab...
Kevin Miller
CONEXT
2006
ACM
14 years 1 months ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack
CONTEXT
2007
Springer
14 years 2 months ago
Context Modeling: Task Model and Practice Model
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
Patrick Brézillon