Sciweavers

2432 search results - page 371 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
ICDCSW
2006
IEEE
15 years 3 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu
ECAL
2003
Springer
15 years 3 months ago
Pattern Recognition in a Bucket
This paper demonstrates that the waves produced on the surface of water can be used as the medium for a “Liquid State Machine” that pre-processes inputs so allowing a simple pe...
Chrisantha Fernando, Sampsa Sojakka
GC
2008
Springer
14 years 10 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
SIAMSC
2008
173views more  SIAMSC 2008»
14 years 9 months ago
A Fast Iterative Method for Eikonal Equations
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
Won-Ki Jeong, Ross T. Whitaker
GRAPHICSINTERFACE
2009
14 years 7 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...