Sciweavers

1527 search results - page 189 / 306
» Hidden word statistics
Sort
View
CHI
2006
ACM
16 years 1 months ago
Answering why and why not questions in user interfaces
Modern applications such as Microsoft Word have many automatic features and hidden dependencies that are frequently helpful but can be mysterious to both novice and expert users. ...
Brad A. Myers, David A. Weitzman, Andrew Jensen Ko...
SIGMOD
2001
ACM
145views Database» more  SIGMOD 2001»
16 years 1 months ago
Automatic Segmentation of Text into Structured Records
In this paper we present a method for automatically segmenting unformatted text records into structured elements. Several useful data sources today are human-generated as continuo...
Vinayak R. Borkar, Kaustubh Deshmukh, Sunita Saraw...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 11 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
MODELS
2009
Springer
15 years 8 months ago
Catch Me If You Can - Debugging Support for Model Transformations
Abstract. Model-Driven Engineering places models as first-class artifacts throughout the software lifecycle requiring the availability of proper transformation languages. Although...
Johannes Schönböck, Gerti Kappel, Angeli...
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
15 years 7 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson