Sciweavers

1018 search results - page 73 / 204
» Generative unbinding of names
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 2 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
CIKM
2008
Springer
13 years 11 months ago
Mapping enterprise entities to text segments
Today, valuable business information is increasingly stored as unstructured data (documents, emails, etc.). For example, documents exchanged between business partners capture info...
Falk Brauer, Alexander Löser, Hong-Hai Do
DIM
2005
ACM
13 years 11 months ago
Usable presentation of secure pseudonyms
Privacy-Enhancing Identity Management (PIM) enables users to control which personal information they provide to their communication partner(s) by partitioning their personal infor...
Katrin Borcea-Pfitzmann, Elke Franz, Andreas Pfitz...
IESA
2007
13 years 10 months ago
UN/CEFACT Core Components as the basis for structured business communication by SMEs, employing auto-generated, user adjustable
In this paper a methodology is presented to generate webforms for business documents directly from XML schemas. XML Schemas that are based on the UN/CEFACT Naming and Design Rules ...
Fred van Blommestein, Bertjan Broeksema
ACL
2008
13 years 10 months ago
Semantic Class Learning from the Web with Hyponym Pattern Linkage Graphs
We present a novel approach to weakly supervised semantic class learning from the web, using a single powerful hyponym pattern combined with graph structures, which capture two pr...
Zornitsa Kozareva, Ellen Riloff, Eduard H. Hovy