Sciweavers

13214 search results - page 2564 / 2643
» Pseudorandomness for network algorithms
Sort
View
IPM
2008
100views more  IPM 2008»
15 years 4 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
IJFCS
2006
106views more  IJFCS 2006»
15 years 4 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
JSAC
2008
140views more  JSAC 2008»
15 years 4 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
KER
2008
193views more  KER 2008»
15 years 4 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
SIAMSC
2008
149views more  SIAMSC 2008»
15 years 4 months ago
Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation
In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematic...
Peter Deuflhard, Wilhelm Huisinga, T. Jahnke, Mich...
« Prev « First page 2564 / 2643 Last » Next »