Sciweavers

1322 search results - page 219 / 265
» Parameterized counting problems
Sort
View
IICS
2003
Springer
14 years 3 months ago
Where to Start Browsing the Web?
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
Dániel Fogaras
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 2 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
EUROCRYPT
2001
Springer
14 years 2 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
SEMWEB
2001
Springer
14 years 2 months ago
Accessing Information and Services on the DAML-Enabled Web
Querying the Web today can be a frustrating activity because the results delivered by syntactically oriented search engines often do not match the intentions of the user. The DARP...
Grit Denker, Jerry R. Hobbs, David L. Martin, Srin...
WIA
2001
Springer
14 years 2 months ago
Past Pushdown Timed Automata
d Abstract) Zhe Dang   , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard ...