Sciweavers

362 search results - page 60 / 73
» Finding Motifs with Gaps
Sort
View
IANDC
2008
128views more  IANDC 2008»
13 years 7 months ago
Rule-based static analysis of network protocol implementations
Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attack...
Octavian Udrea, Cristian Lumezanu, Jeffrey S. Fost...
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
MTA
2008
179views more  MTA 2008»
13 years 7 months ago
Explicit semantic events detection and development of realistic applications for broadcasting baseball videos
This paper presents a framework that explicitly detects events in broadcasting baseball videos and facilitates the development of many practical applications. Three phases of contr...
Wei-Ta Chu, Ja-Ling Wu
TCBB
2008
120views more  TCBB 2008»
13 years 7 months ago
Learning Scoring Schemes for Sequence Alignment from Partial Examples
When aligning biological sequences, the choice of scoring scheme is critical. Even small changes in gap penalties, for example, can yield radically different alignments. A rigorous...
Eagu Kim, John D. Kececioglu
TCS
2008
13 years 7 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh