Sciweavers

273 search results - page 46 / 55
» Electricity Markets: How Many, Where and When
Sort
View
FOCS
2008
IEEE
13 years 8 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Validation of an NSP-based (negative selection pattern) gene family identification strategy
Background: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genom...
Ronald L. Frank, Cyriac Kandoth, Fikret Erç...
JSAC
2006
167views more  JSAC 2006»
13 years 7 months ago
Secure and resilient clock synchronization in wireless sensor networks
Abstract--Wireless sensor networks have received a lot of attention recently due to its wide applications. An accurate and synchronized clock time is crucial in many sensor network...
Kun Sun, Peng Ning, Cliff Wang
CIVR
2010
Springer
246views Image Analysis» more  CIVR 2010»
13 years 5 months ago
Genre-specific semantic video indexing
In many applications, we find large video collections from different genres where the user is often only interested in one or two specific video genres. So, when users are queryin...
Jun Wu, Marcel Worring
IANDC
2008
141views more  IANDC 2008»
13 years 7 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...