Sciweavers

1222 search results - page 80 / 245
» Some Results on Directable Automata
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
TSD
2007
Springer
15 years 4 months ago
Using Query-Relevant Documents Pairs for Cross-Lingual Information Retrieval
The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to de...
David Pinto, Alfons Juan, Paolo Rosso
SPAA
2006
ACM
15 years 3 months ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
BIRTHDAY
2005
Springer
15 years 3 months ago
Splitting Logics
This paper addresses the question of factoring a logic into families of (generally simpler) components, estimating the top– down perspective, splitting, versus the bottom–up, s...
Walter Alexandre Carnielli, Marcelo E. Coniglio
ICML
2007
IEEE
15 years 10 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti