Sciweavers

4761 search results - page 588 / 953
» Generalizing Boundary Points
Sort
View
DCC
2007
IEEE
16 years 6 months ago
On the structure of 1-designs with at most two block intersection numbers
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
John Arhin
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
TEI
2010
ACM
257views Hardware» more  TEI 2010»
16 years 1 months ago
Traditional games meet ICT: a case study on go game augmentation
While pervasive technologies explore new gaming styles, traditional games, such as cards and tabletop games are still appealing and have various irreplaceable flavors. We point ou...
Takahiro Iwata, Tetsuo Yamabe, Mikko Polojärv...
DAC
2009
ACM
16 years 1 months ago
ARMS - automatic residue-minimization based sampling for multi-point modeling techniques
This paper describes an automatic methodology for optimizing sample point selection for using in the framework of model order reduction (MOR). The procedure, based on the maximiza...
Jorge Fernandez Villena, Luis Miguel Silveira
CCS
2009
ACM
16 years 1 months ago
Active learning for network intrusion detection
Anomaly detection for network intrusion detection is usually considered an unsupervised task. Prominent techniques, such as one-class support vector machines, learn a hypersphere ...
Nico Görnitz, Marius Kloft, Konrad Rieck, Ulf...