Sciweavers

146 search results - page 23 / 30
» Connectivity of chamber graphs of buildings and related comp...
Sort
View
UAI
2007
15 years 7 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond
ICSE
2000
IEEE-ACM
15 years 9 months ago
Software needs engineering: a position paper
When the general press refers to `software' in its headlines, then this is often not to relate a success story, but to expand on yet another `software-risk-turned-problem-sto...
Jane Grimson, Hans-Jürgen Kugler
172
Voted
ICML
2006
IEEE
16 years 6 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ACIVS
2006
Springer
16 years 2 days ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie