Sciweavers

2485 search results - page 192 / 497
» Time Bounded Frequency Computations
Sort
View
STACS
2010
Springer
16 years 1 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
WISEC
2009
ACM
16 years 1 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
16 years 6 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
CONEXT
2006
ACM
16 years 15 days ago
Modeling ping times in first person shooter games
In First Person Shooter (FPS) games the Round Trip Time (RTT), i.e., the sum of the network delay from client to server and the network delay from server to client, impacts the ga...
Natalie Degrande, Danny De Vleeschauwer, Robert E....