Sciweavers

183 search results - page 29 / 37
» Complete Minors and Independence Number
Sort
View
SPAA
2009
ACM
14 years 4 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
MOBICOM
2012
ACM
11 years 10 months ago
Argos: practical many-antenna base stations
Multi-user multiple-input multiple-output theory predicts manyfold capacity gains by leveraging many antennas on wireless base stations to serve multiple clients simultaneously th...
Clayton Shepard, Hang Yu, Narendra Anand, Erran Li...
BMCBI
2006
123views more  BMCBI 2006»
13 years 7 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 9 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
14 years 2 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens