Sciweavers

93
Voted
TVCG
2008
174views more  TVCG 2008»
15 years 13 days ago
Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
Michael ten Caat, Natasha M. Maurits, Jos B. T. M....
TNN
2008
182views more  TNN 2008»
15 years 13 days ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
84
Voted
IPM
2008
85views more  IPM 2008»
15 years 16 days ago
A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time
In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI
Arnaud Quirin, Oscar Cordón, Jose Santamar&...
81
Voted
CORR
2006
Springer
97views Education» more  CORR 2006»
15 years 17 days ago
Improved Nearly-MDS Expander Codes
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
Ron M. Roth, Vitaly Skachek
GPEM
2008
98views more  GPEM 2008»
15 years 18 days ago
Sporadic model building for efficiency enhancement of the hierarchical BOA
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
Martin Pelikan, Kumara Sastry, David E. Goldberg
98
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 19 days ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
88
Voted
ALMOB
2008
95views more  ALMOB 2008»
15 years 21 days ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
105
Voted
AI
2008
Springer
15 years 21 days ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
75
Voted
CVPR
2010
IEEE
15 years 23 days ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...
AIPS
2009
15 years 1 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla