Sciweavers

5771 search results - page 999 / 1155
» Learning similarity space
Sort
View
213
Voted
AIPS
2010
15 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
221
Voted
BIRTHDAY
2010
Springer
15 years 8 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
207
Voted
FOCS
2008
IEEE
15 years 7 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
229
Voted
BMCBI
2010
243views more  BMCBI 2010»
15 years 7 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
BMCBI
2008
148views more  BMCBI 2008»
15 years 7 months ago
Discovering biclusters in gene expression data based on high-dimensional linear geometries
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
Xiangchao Gan, Alan Wee-Chung Liew, Hong Yan