Sciweavers

16430 search results - page 60 / 3286
» On Computable Tree Functions
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
MEMBRANE
2009
Springer
14 years 4 months ago
A Look Back at Some Early Results in Membrane Computing
em is a computing model, which abstracts from the way the living cells process chemical compounds in their compartmental structure. The regions defined by a membrane structure con...
Oscar H. Ibarra
DAC
2004
ACM
14 years 11 months ago
An approach to placement-coupled logic replication
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
Milos Hrkic, John Lillis, Giancarlo Beraudo
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 10 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
SIGIR
2003
ACM
14 years 3 months ago
Question classification using support vector machines
Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. W...
Dell Zhang, Wee Sun Lee