Sciweavers

8431 search results - page 1429 / 1687
» Algorithmically Independent Sequences
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Untangling triangulations through local explorations
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
Pankaj K. Agarwal, Bardia Sadri, Hai Yu
FLAIRS
2004
15 years 8 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 8 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
NIPS
1998
15 years 8 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 years 6 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
« Prev « First page 1429 / 1687 Last » Next »