Sciweavers

244 search results - page 40 / 49
» A Linear Search Strategy using Bounds
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 7 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
CIBCB
2007
IEEE
14 years 2 months ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
ISLPED
2003
ACM
142views Hardware» more  ISLPED 2003»
14 years 1 months ago
Minimization of dynamic and static power through joint assignment of threshold voltages and sizing optimization
We describe an optimization strategy for minimizing total power consumption using dual threshold voltage (Vth) technology. Significant power savings are possible by simultaneous a...
David Nguyen, Abhijit Davare, Michael Orshansky, D...
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 1 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
DBA
2006
236views Database» more  DBA 2006»
13 years 10 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...