Sciweavers

736 search results - page 140 / 148
» Approximating the Number of Network Motifs
Sort
View
EJC
2007
13 years 7 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
IDA
2002
Springer
13 years 7 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
TCSV
2002
107views more  TCSV 2002»
13 years 7 months ago
Design, performance analysis, and implementation of a super-scalar video-on-demand system
Despite the availability of video-on-demand (VoD) services in a number of cities around the world, large-scale deployment of VoD services in a metropolitan area is still economical...
Jack Y. B. Lee, C. H. Lee
TWC
2010
13 years 2 months ago
Distributed consensus-based demodulation: algorithms and error analysis
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
Hao Zhu, Alfonso Cano, Georgios B. Giannakis