Sciweavers

5595 search results - page 857 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
VL
1996
IEEE
157views Visual Languages» more  VL 1996»
15 years 10 months ago
Visualizing Program Executions on Large Data Sets
Understanding and interpreting a large data source is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to he...
John T. Stasko, Jeyakumar Muthukumarasamy
CIBCB
2007
IEEE
15 years 10 months ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre
LREC
2008
174views Education» more  LREC 2008»
15 years 8 months ago
UnsuParse: unsupervised Parsing with unsupervised Part of Speech Tagging
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
Christian Hänig, Stefan Bordag, Uwe Quasthoff
IADIS
2004
15 years 8 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...
HIS
2003
15 years 8 months ago
Design of Transparent Mamdani Fuzzy Inference Systems
: In this paper, we propose a technique to design Fuzzy Inference Systems (FIS) of Mamdani type with transparency constraints. The technique is based on our Crisp Double Clustering...
Giovanna Castellano, Anna Maria Fanelli, Corrado M...