Sciweavers

1884 search results - page 7 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
TASLP
2010
118views more  TASLP 2010»
14 years 8 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...
GLOBECOM
2009
IEEE
15 years 1 months ago
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
FCT
2005
Springer
15 years 3 months ago
A Simple and Fast Min-cut Algorithm
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
Michael Brinkmeier
DCC
2008
IEEE
15 years 9 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth
CCCG
2010
14 years 11 months ago
Watchman route in a simple polygon with a rubberband algorithm
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
Fajie Li, Reinhard Klette