Sciweavers

2180 search results - page 60 / 436
» Algorithms for discovering bucket orders from data
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 3 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
LION
2009
Springer
112views Optimization» more  LION 2009»
15 years 10 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
133
Voted
ICTAI
2003
IEEE
15 years 9 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
ICDE
2007
IEEE
169views Database» more  ICDE 2007»
15 years 10 months ago
Mining Personally Important Places from GPS Tracks
The discovery of a person’s personally important places involves obtaining the physical locations for a person’s places that matter to his daily life and routines. This proble...
Changqing Zhou, Nupur Bhatnagar, Shashi Shekhar, L...
ACL
2006
15 years 5 months ago
Weakly Supervised Named Entity Transliteration and Discovery from Multilingual Comparable Corpora
Named Entity recognition (NER) is an important part of many natural language processing tasks. Current approaches often employ machine learning techniques and require supervised d...
Alexandre Klementiev, Dan Roth