Sciweavers

714 search results - page 4 / 143
» An efficient algorithm for positive realizations
Sort
View
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 2 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
CCECE
2006
IEEE
14 years 2 months ago
A Software Defined Radio Receiver Architecture for UWB Communications and Positioning
A software defined radio (SDR) receiver architecture is proposed in this paper for ultra-wideband (UWB) applications. Both UWB data communication and positioning functions are imp...
Yanyang Zhao, Ligen Wang, Jean-François Fri...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
ICOIN
2004
Springer
14 years 1 months ago
Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively rein...
Jae Seuk Oh, Sung-il Bae, Jin-Ho Ahn, Sungho Kang
SPAA
1993
ACM
14 years 15 days ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein