Sciweavers

4498 search results - page 533 / 900
» How to Invent Functions
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
JSYML
2011
89views more  JSYML 2011»
14 years 9 months ago
Forcing properties of ideals of closed sets
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
Marcin Sabok, Jindrich Zapletal
ICCV
2011
IEEE
14 years 6 months ago
Learning to Cluster Using High Order Graphical Models with Latent Variables
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...
Nikos Komodakis
AADA
2011
14 years 6 months ago
Sparse Template-Based variational Image Segmentation
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
Dirk Breitenreicher, Jan Lellmann, Christoph Schn&...
206
Voted
EMNLP
2011
14 years 6 months ago
Bootstrapping Semantic Parsers from Conversations
Conversations provide rich opportunities for interactive, continuous learning. When something goes wrong, a system can ask for clarification, rewording, or otherwise redirect the...
Yoav Artzi, Luke S. Zettlemoyer