Sciweavers

1161 search results - page 148 / 233
» Kinetic Dependence Graphs
Sort
View
IJCAI
1997
14 years 12 months ago
Machine Learning Techniques to Make Computers Easier to Use
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Hiroshi Motoda, Kenichi Yoshida
ICASSP
2010
IEEE
14 years 10 months ago
Graph-spectrum-based neural spike features for stereotrodes and tetrodes
Extracellular recording of neural signals records the action potentials (known as spikes) of neurons adjacent to the electrode as well as the noise generated by the overall neural...
Yasser Ghanbari, Panos Papamichalis, Larry Spence
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 10 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa
COMCOM
2006
110views more  COMCOM 2006»
14 years 10 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 10 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker