Sciweavers

5904 search results - page 1123 / 1181
» Requirements for a Composition Language
Sort
View
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
14 years 9 months ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 9 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2002
ACM
179views Data Mining» more  KDD 2002»
14 years 9 months ago
From Data To Insight: The Community Of Multimedia Agents
Multimedia Data Mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project (COMMA) is devoted to creating an open ...
Gang Wei, Valery A. Petrushin, Anatole Gershman
CHI
2006
ACM
14 years 9 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
ICALP
2009
Springer
14 years 9 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
« Prev « First page 1123 / 1181 Last » Next »