Sciweavers

3413 search results - page 590 / 683
» New Support Vector Algorithms
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 9 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 9 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 3 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
14 years 2 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
ATAL
2005
Springer
14 years 2 months ago
Thespian: using multi-agent fitting to craft interactive drama
There has been a growing interest in designing multi-agent based interactive dramas. A key research challenge faced in the design of these systems is to support open-ended user in...
Mei Si, Stacy Marsella, David V. Pynadath